Balanced sets and circuits in a transversal space
نویسندگان
چکیده
منابع مشابه
Transversal Partitioning in Balanced Hypergraphs
A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal of a hypergraph is a set of vertices such that every hyperedge has at least k elements of. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union of k pairwise disjoint transversals and such partition can be obtained in polynomial time. We give an N...
متن کاملClique-Transversal Sets in Cubic Graphs
A clique-transversal set S of a graph G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted τc(G), is the minimum cardinality of a clique-transversal set in G. In this paper we present an upper bound and a lower bound on τc(G) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp u...
متن کاملBalanced independent sets in hypercubes
The n-dimensional hypercube Qn has many maximal independent sets of vertices. We study the cardinality of those maximal independent sets which are balanced , i.e. exactly half of whose vertices have even weight, obtaining both upper and lower bounds for the maximum value. For n ≤ 7 we obtain the exact value. For all odd n, we conjecture that the exact value is 2n−1 − ( n−1 (n−1)/2 ) . We also c...
متن کاملNielsen theory of transversal fixed point sets
Examples exist of smooth maps on the boundary of a smooth manifold M which allow continuous extensions over M without fixed points but no such smooth extensions. Such maps are studied here in more detail. They have a minimal fixed point set when all transversally fixed maps in their homotopy class are considered. Therefore we introduce a Nielsen fixed point theory for transversally fixed maps o...
متن کاملA colorful theorem on transversal lines to plane convex sets
In 1982 (see [1]) Imre Bárány observed that some of the classical theorems in convexity admit interesting and mysterious generalizations which he called “colorful theorems”. For example, the Colorful Helly Theorem says that if a family (repetitions of the same sets are allowed) of compact convex sets in Rk is colored (properly) with k+1 colors and it has the property that any choice of k+1 diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1977
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90053-3